#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
const int maxn = 105;
int num[maxn],n,numsum;
string s;
bool dp[1000010];

void read(){
	int cnt=1,tmp=0;
	char c;
	for(int i=0;i<s.size();i++){
		c=s[i];
		if(c==','){
			num[cnt++]=tmp;
			tmp=0;
		}else if((c-'0')>=0 && (c-'0')<=9){
			tmp=tmp*10+c-'0';
		}
	}
	num[cnt]=tmp;
	n=cnt;
}

void dfs(int a,int sum){
	//cout<<sum<<endl;
	if(sum>(numsum/2))return;
	dp[sum]=true;
	for(int i=a+1;i<=n;i++){
		dfs(i,sum+num[i]);
	}
}

int main(){

	while(cin>>s){
		numsum=0;
		memset(dp,0,sizeof dp);
		read();
		for(int i=1;i<=n;i++)numsum+=num[i];
		if(numsum%2!=0){
			cout<<"false"<<endl;
			continue;	
		}
		for(int i=1;i<=n;i++){
			dfs(i,num[i]);
		}
		if(dp[numsum/2])cout<<"true"<<endl;
		else cout<<"false"<<endl;
	}
}
